package com.lwl.Algorithmic_data_structure.class10_11二叉树;

import com.lwl.Utils.MyTreeNode;

/**
 * @author lwl
 * @Description 非递归实现先序遍历
 * @date 2023/5/22 22:07
 */
public class Code01UnRecursiveTraversalBT {

    /*
                 1
              2    3
            4  5  6  7
     */
    public static void main(String[] args) {
        MyTreeNode node1 = new MyTreeNode(1);
        node1.left = new MyTreeNode(2);
        node1.right = new MyTreeNode(3);
        node1.left.left = new MyTreeNode(4);
        node1.left.right = new MyTreeNode(5);
        node1.right.left = new MyTreeNode(6);
        node1.right.right = new MyTreeNode(7);

        node1.traverseFirstBinaryTree();
        node1.traverseMidBinaryTree();
        node1.traverseLevelBinaryTree();
    }


}
